Realtime Registration-Based Tracking via Approximate Nearest Neighbour Search
نویسندگان
چکیده
We introduce a new 2D visual tracking algorithm that utilizes an approximate nearest neighbour search to estimate per-frame state updates. We experimentally demonstrate that the new algorithm capable of estimating larger per-frame motions than the standard registration-based algorithms and that it is more robust in a vision-controlled robotic alignment task.
منابع مشابه
CNN Based Appearance Model with Approximate Nearest Neigbour Search
Visual Object Tracking is an important module in a variety of applications, such as: surveillance, human computer interaction, and visual servoing. The main goal is to compute the trajectory of the object of interest given an initial bounding box for the object. 2D tracking is when the trajectory of the object is computed in terms of camera coordinates.It has been heavily investigated in the pa...
متن کاملThe Area Code Tree for Approximate Nearest Neighbour Search in Dense Point Sets
In this paper, we present an evaluation of nearest neighbour searching using the Area Code tree. The Area Code tree is a trie-type structure that organizes area code representations of each point of interest (POI) in a data set. This data structure provides a fast method for locating an actual or approximate nearest neighbour POI for a query point. We first summarize the area code generation, i...
متن کاملSome improvements on NN based classifiers in metric spaces
The nearest neighbour (NN) and k-nearest neighbour (k-NN) classification rules have been widely used in Pattern Recognition due to its simplicity and good behaviour. Exhaustive nearest neighbour search may become unpractical when facing large training sets, high dimensional data or expensive dissimilarity measures (distances). During the last years a lot of fast NN search algorithms have been d...
متن کاملApproximate Nearest-Neighbour Search with Inverted Signature Slice Lists
In this paper we present an original approach for finding approximate nearest neighbours in collections of locality-sensitive hashes. The paper demonstrates that this approach makes high-performance nearest-neighbour searching feasible on Web-scale collections and commodity hardware with minimal degradation in search quality.
متن کاملExtending Fast Nearest Neighbour Search Algorithms for Approximate k-NN Classification
The nearest neighbour (NN) and k-nearest neighbour (kNN) classi cation rules have been widely used in pattern recognition due to its simplicity and good behaviour. Exhaustive nearest neighbour search can become unpractical when facing large training sets, high dimensional data or expensive similarity measures. In the last years a lot of NN search algorithms have been developed to overcome those...
متن کامل